A heuristic for the periodic rural postman problem
نویسندگان
چکیده
Dipartimento di Ingegneria dell’Innovazione, Universit a degli Studi di Lecce, Lecce 73100, Italy Dipartimento di Elettronica, Informatica e Sistemistica, Universit a degli Studi della Calabria, Rende (CS) 87030, Italy Dipartimento di Economia e Statistica, Universit a degli Studi della Calabria, Rende (CS) 87030, Italy Dipartimento di Matematica, Universit a degli Studi di Lecce, Lecce 73100, Italy
منابع مشابه
Capacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...
متن کاملNew heuristic algorithms for the windy rural postman problem
In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Problem. Extensive computational experiments over different sets of instances, with sizes up to 988 ...
متن کاملThe Windy Prize-Collecting Rural Postman Problem: An Ant-Colony Based Heuristic
The Prize-collecting Rural Postman Problem, also known as the Privatized Rural Postman Problem, is an arc-routing problem where each demand edge is associated with a profit, which is collected once if the edge is served, independently of the number of traversals. Included edges incur in routing costs proportionally to the number of traversals. In this paper, we introduce the Windy Privatized Ru...
متن کاملHeuristics for the Weighted k-Chinese/rural Postman Problem with a Hint of Fixed Costs with Applications to Urban Snow Removal
We describe a weighted version of the k-Chinese or k-rural postman problem that occurs in the context of snow removal. The problem concerns the questions of which vehicle shall do each task and how the vehicles shall travel between tasks. We also consider different numbers of vehicles, in view of a fixed cost for each vehicle. We describe and discuss heuristic solution approaches, based on usab...
متن کاملLower bounds and heuristics for the Windy Rural Postman Problem
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routing Problems as special cases and has very interesting real-life applications. Extensive computational experiments over different sets of instances are also presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 32 شماره
صفحات -
تاریخ انتشار 2005